#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+10;
int n,ans;
int a[MAXN];
queue<int> q;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    q.push(a[1]);
    for(int i=2;i<=n;i++)
    {
        if(a[i]>q.front())
        {
            q.pop();
        }
        q.push(a[i]);
    }
    cout<<q.size()<<endl;
    return 0;
}
